0.13/0.13 % Problem : Vampire---4.8_31179 : TPTP v0.0.0. Released v0.0.0. 0.13/0.14 % Command : run_E %s %d THM 0.15/0.35 % Computer : n015.cluster.edu 0.15/0.35 % Model : x86_64 x86_64 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.15/0.35 % Memory : 8042.1875MB 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.15/0.35 % CPULimit : 1440 0.15/0.35 % WCLimit : 180 0.15/0.35 % DateTime : Mon Jul 3 13:02:10 EDT 2023 0.15/0.36 % CPUTime : 0.21/0.48 Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.EFL5fDBfe3/Vampire---4.8_31179 0.21/0.48 # Version: 3.1pre001-ho 0.21/0.49 # Preprocessing class: HSSSSMSSSSSNSSA. 0.21/0.49 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 0.21/0.49 # Starting post_as_ho12 with 180s (1) cores 0.21/0.49 # Starting new_bool_9 with 180s (1) cores 0.21/0.49 # Starting post_as_ho1 with 180s (1) cores 0.21/0.49 # Starting post_as_ho4 with 180s (1) cores 0.21/0.49 # Starting post_as_ho2 with 180s (1) cores 0.21/0.49 # Starting ehoh_best2_full_lfho with 180s (1) cores 0.21/0.49 # Starting full_lambda_10 with 180s (1) cores 0.21/0.49 # Starting new_ho_8 with 180s (1) cores 0.21/0.49 # ehoh_best2_full_lfho with pid 31366 completed with status 0 0.21/0.49 # Result found by ehoh_best2_full_lfho 0.21/0.49 # Preprocessing class: HSSSSMSSSSSNSSA. 0.21/0.49 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 0.21/0.49 # Starting post_as_ho12 with 180s (1) cores 0.21/0.49 # Starting new_bool_9 with 180s (1) cores 0.21/0.49 # Starting post_as_ho1 with 180s (1) cores 0.21/0.49 # Starting post_as_ho4 with 180s (1) cores 0.21/0.49 # Starting post_as_ho2 with 180s (1) cores 0.21/0.49 # Starting ehoh_best2_full_lfho with 180s (1) cores 0.21/0.49 # No SInE strategy applied 0.21/0.49 # Search class: HHUNF-FFSF21-SSSFFMBN 0.21/0.49 # partial match(1): HGUNF-FFSF21-SSSFFMBN 0.21/0.49 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.21/0.49 # Starting new_ho_10 with 98s (1) cores 0.21/0.49 # new_ho_10 with pid 31374 completed with status 9 0.21/0.49 # Starting ehoh_best2_full_lfho with 19s (1) cores 0.21/0.49 # ehoh_best2_full_lfho with pid 31381 completed with status 0 0.21/0.49 # Result found by ehoh_best2_full_lfho 0.21/0.49 # Preprocessing class: HSSSSMSSSSSNSSA. 0.21/0.49 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 0.21/0.49 # Starting post_as_ho12 with 180s (1) cores 0.21/0.49 # Starting new_bool_9 with 180s (1) cores 0.21/0.49 # Starting post_as_ho1 with 180s (1) cores 0.21/0.49 # Starting post_as_ho4 with 180s (1) cores 0.21/0.49 # Starting post_as_ho2 with 180s (1) cores 0.21/0.49 # Starting ehoh_best2_full_lfho with 180s (1) cores 0.21/0.49 # No SInE strategy applied 0.21/0.49 # Search class: HHUNF-FFSF21-SSSFFMBN 0.21/0.49 # partial match(1): HGUNF-FFSF21-SSSFFMBN 0.21/0.49 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.21/0.49 # Starting new_ho_10 with 98s (1) cores 0.21/0.49 # new_ho_10 with pid 31374 completed with status 9 0.21/0.49 # Starting ehoh_best2_full_lfho with 19s (1) cores 0.21/0.49 # Preprocessing time : 0.001 s 0.21/0.49 0.21/0.49 # Proof found! 0.21/0.49 # SZS status Theorem 0.21/0.49 # SZS output start CNFRefutation 0.21/0.49 thf(decl_22, type, c_starc: c > c > c). 0.21/0.49 thf(decl_23, type, c_starb: b > b > b). 0.21/0.49 thf(decl_24, type, c_stara: a > a > a). 0.21/0.49 thf(decl_25, type, esk1_0: a > b). 0.21/0.49 thf(decl_26, type, esk2_0: a > c). 0.21/0.49 thf(decl_27, type, esk3_0: b > c). 0.21/0.49 thf(decl_28, type, esk4_1: b > a). 0.21/0.49 thf(decl_29, type, esk5_0: b). 0.21/0.49 thf(decl_30, type, esk6_0: b). 0.21/0.49 thf(decl_31, type, epred1_0: c > $o). 0.21/0.49 thf(cTHM270_INST, conjecture, ![X1:a > b, X2:a > c, X3:b > c]:(((((![X4:a, X5:a, X6:b > $o]:(((X6 @ (c_starb @ (X1 @ X4) @ (X1 @ X5)))<=(X6 @ (X1 @ (c_stara @ X4 @ X5)))))&![X4:a, X5:a, X7:c > $o]:(((X7 @ (X2 @ (c_stara @ X4 @ X5)))=>(X7 @ (c_starc @ (X2 @ X4) @ (X2 @ X5))))))&![X8:b]:(?[X4:a]:(![X6:b > $o]:(((X6 @ (X1 @ X4))=>(X6 @ X8))))))&![X4:a, X9:c > $o]:(((X9 @ (X2 @ X4))<=(X9 @ (X3 @ (X1 @ X4))))))=>![X10:b, X11:b, X12:c > $o]:(((X12 @ (X3 @ (c_starb @ X10 @ X11)))=>(X12 @ (c_starc @ (X3 @ X10) @ (X3 @ X11))))))), file('/export/starexec/sandbox/tmp/tmp.EFL5fDBfe3/Vampire---4.8_31179', cTHM270_INST)). 0.21/0.49 thf(c_0_1, negated_conjecture, ~(![X1:a > b, X2:a > c, X3:b > c]:(((((![X4:a, X5:a, X6:b > $o]:(((X6 @ (X1 @ (c_stara @ X4 @ X5)))=>(X6 @ (c_starb @ (X1 @ X4) @ (X1 @ X5)))))&![X4:a, X5:a, X7:c > $o]:(((X7 @ (X2 @ (c_stara @ X4 @ X5)))=>(X7 @ (c_starc @ (X2 @ X4) @ (X2 @ X5))))))&![X8:b]:(?[X4:a]:(![X6:b > $o]:(((X6 @ (X1 @ X4))=>(X6 @ X8))))))&![X4:a, X9:c > $o]:(((X9 @ (X3 @ (X1 @ X4)))=>(X9 @ (X2 @ X4)))))=>![X10:b, X11:b, X12:c > $o]:(((X12 @ (X3 @ (c_starb @ X10 @ X11)))=>(X12 @ (c_starc @ (X3 @ X10) @ (X3 @ X11)))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM270_INST])])). 0.21/0.49 thf(c_0_2, negated_conjecture, ![X33:a, X34:a, X35:b > $o, X36:a, X37:a, X38:c > $o, X39:b, X41:b > $o, X42:a, X43:c > $o]:((((((~(X35 @ (esk1_0 @ (c_stara @ X33 @ X34)))|(X35 @ (c_starb @ (esk1_0 @ X33) @ (esk1_0 @ X34))))&(~(X38 @ (esk2_0 @ (c_stara @ X36 @ X37)))|(X38 @ (c_starc @ (esk2_0 @ X36) @ (esk2_0 @ X37)))))&(~(X41 @ (esk1_0 @ (esk4_1 @ X39)))|(X41 @ X39)))&(~(X43 @ (esk3_0 @ (esk1_0 @ X42)))|(X43 @ (esk2_0 @ X42))))&((epred1_0 @ (esk3_0 @ (c_starb @ esk5_0 @ esk6_0)))&~(epred1_0 @ (c_starc @ (esk3_0 @ esk5_0) @ (esk3_0 @ esk6_0)))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])). 0.21/0.49 thf(c_0_3, negated_conjecture, ![X7:c > $o, X4:a]:(((X7 @ (esk2_0 @ X4))|~((X7 @ (esk3_0 @ (esk1_0 @ X4)))))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.49 thf(c_0_4, negated_conjecture, ![X6:b > $o, X8:b]:(((X6 @ X8)|~((X6 @ (esk1_0 @ (esk4_1 @ X8)))))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.49 thf(c_0_5, negated_conjecture, ![X4:a, X6:b > $o, X5:a]:(((X6 @ (c_starb @ (esk1_0 @ X4) @ (esk1_0 @ X5)))|~((X6 @ (esk1_0 @ (c_stara @ X4 @ X5)))))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.49 thf(c_0_6, negated_conjecture, ![X4:a, X7:c > $o, X5:a]:(((X7 @ (c_starc @ (esk2_0 @ X4) @ (esk2_0 @ X5)))|~((X7 @ (esk2_0 @ (c_stara @ X4 @ X5)))))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.49 thf(c_0_7, negated_conjecture, ![X4:a]:(((esk3_0 @ (esk1_0 @ X4))=(esk2_0 @ X4))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_3])). 0.21/0.49 thf(c_0_8, negated_conjecture, ![X8:b]:(((esk1_0 @ (esk4_1 @ X8))=(X8))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_4])). 0.21/0.49 thf(c_0_9, negated_conjecture, ![X4:a, X5:a]:(((c_starb @ (esk1_0 @ X4) @ (esk1_0 @ X5))=(esk1_0 @ (c_stara @ X4 @ X5)))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_5])). 0.21/0.49 thf(c_0_10, negated_conjecture, ![X4:a, X5:a]:(((c_starc @ (esk2_0 @ X4) @ (esk2_0 @ X5))=(esk2_0 @ (c_stara @ X4 @ X5)))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_6])). 0.21/0.49 thf(c_0_11, negated_conjecture, ![X8:b]:(((esk2_0 @ (esk4_1 @ X8))=(esk3_0 @ X8))), inference(spm,[status(thm)],[c_0_7, c_0_8])). 0.21/0.49 thf(c_0_12, negated_conjecture, ![X4:a, X8:b]:(((esk1_0 @ (c_stara @ X4 @ (esk4_1 @ X8)))=(c_starb @ (esk1_0 @ X4) @ X8))), inference(spm,[status(thm)],[c_0_9, c_0_8])). 0.21/0.49 thf(c_0_13, negated_conjecture, ![X4:a, X8:b]:(((esk2_0 @ (c_stara @ X4 @ (esk4_1 @ X8)))=(c_starc @ (esk2_0 @ X4) @ (esk3_0 @ X8)))), inference(spm,[status(thm)],[c_0_10, c_0_11])). 0.21/0.49 thf(c_0_14, negated_conjecture, ![X4:a, X8:b]:(((c_starc @ (esk2_0 @ X4) @ (esk3_0 @ X8))=(esk3_0 @ (c_starb @ (esk1_0 @ X4) @ X8)))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_12]), c_0_13])). 0.21/0.49 thf(c_0_15, negated_conjecture, ~((epred1_0 @ (c_starc @ (esk3_0 @ esk5_0) @ (esk3_0 @ esk6_0)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.49 thf(c_0_16, negated_conjecture, ![X8:b, X10:b]:(((c_starc @ (esk3_0 @ X8) @ (esk3_0 @ X10))=(esk3_0 @ (c_starb @ X8 @ X10)))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_11]), c_0_8])). 0.21/0.49 thf(c_0_17, negated_conjecture, (epred1_0 @ (esk3_0 @ (c_starb @ esk5_0 @ esk6_0))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.49 thf(c_0_18, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15, c_0_16]), c_0_17])]), ['proof']). 0.21/0.49 # SZS output end CNFRefutation 0.21/0.49 # Parsed axioms : 7 0.21/0.49 # Removed by relevancy pruning/SinE : 0 0.21/0.49 # Initial clauses : 12 0.21/0.49 # Removed in clause preprocessing : 6 0.21/0.49 # Initial clauses in saturation : 6 0.21/0.49 # Processed clauses : 28 0.21/0.49 # ...of these trivial : 11 0.21/0.49 # ...subsumed : 0 0.21/0.49 # ...remaining for further processing : 17 0.21/0.49 # Other redundant clauses eliminated : 0 0.21/0.49 # Clauses deleted for lack of memory : 0 0.21/0.49 # Backward-subsumed : 0 0.21/0.49 # Backward-rewritten : 6 0.21/0.49 # Generated clauses : 55 0.21/0.49 # ...of the previous two non-redundant : 43 0.21/0.49 # ...aggressively subsumed : 0 0.21/0.49 # Contextual simplify-reflections : 0 0.21/0.49 # Paramodulations : 23 0.21/0.49 # Factorizations : 0 0.21/0.49 # NegExts : 0 0.21/0.49 # Equation resolutions : 0 0.21/0.49 # Total rewrite steps : 31 0.21/0.49 # Propositional unsat checks : 0 0.21/0.49 # Propositional check models : 0 0.21/0.49 # Propositional check unsatisfiable : 0 0.21/0.49 # Propositional clauses : 0 0.21/0.49 # Propositional clauses after purity: 0 0.21/0.49 # Propositional unsat core size : 0 0.21/0.49 # Propositional preprocessing time : 0.000 0.21/0.49 # Propositional encoding time : 0.000 0.21/0.49 # Propositional solver time : 0.000 0.21/0.49 # Success case prop preproc time : 0.000 0.21/0.49 # Success case prop encoding time : 0.000 0.21/0.49 # Success case prop solver time : 0.000 0.21/0.49 # Current number of processed clauses : 11 0.21/0.49 # Positive orientable unit clauses : 11 0.21/0.49 # Positive unorientable unit clauses: 0 0.21/0.49 # Negative unit clauses : 0 0.21/0.49 # Non-unit-clauses : 0 0.21/0.49 # Current number of unprocessed clauses: 20 0.21/0.49 # ...number of literals in the above : 29 0.21/0.49 # Current number of archived formulas : 0 0.21/0.49 # Current number of archived clauses : 6 0.21/0.49 # Clause-clause subsumption calls (NU) : 2 0.21/0.49 # Rec. Clause-clause subsumption calls : 2 0.21/0.49 # Non-unit clause-clause subsumptions : 0 0.21/0.49 # Unit Clause-clause subsumption calls : 1 0.21/0.49 # Rewrite failures with RHS unbound : 0 0.21/0.49 # BW rewrite match attempts : 6 0.21/0.49 # BW rewrite match successes : 6 0.21/0.49 # Condensation attempts : 0 0.21/0.49 # Condensation successes : 0 0.21/0.49 # Termbank termtop insertions : 1734 0.21/0.49 0.21/0.49 # ------------------------------------------------- 0.21/0.49 # User time : 0.006 s 0.21/0.49 # System time : 0.003 s 0.21/0.49 # Total time : 0.009 s 0.21/0.49 # Maximum resident set size: 1888 pages 0.21/0.49 0.21/0.49 # ------------------------------------------------- 0.21/0.49 # User time : 0.006 s 0.21/0.49 # System time : 0.006 s 0.21/0.49 # Total time : 0.012 s 0.21/0.49 # Maximum resident set size: 1736 pages 0.21/0.49 % E---3.1 exiting 0.21/0.50 EOF